A Direct Method for Computing Higher Order Folds
نویسندگان
چکیده
منابع مشابه
A Higher Order Iterative Method for Computing the Drazin Inverse
A method with high convergence rate for finding approximate inverses of nonsingular matrices is suggested and established analytically. An extension of the introduced computational scheme to general square matrices is defined. The extended method could be used for finding the Drazin inverse. The application of the scheme on large sparse test matrices alongside the use in preconditioning of line...
متن کاملA Higher-Order Graph Calculus for Autonomic Computing
In this paper, we present a high-level formalism based on port graph rewriting, strategic rewriting, and rewriting calculus. We argue that this formalism is suitable for modeling autonomic systems and briefly illustrate its expressivity for modeling properties of such systems.
متن کاملA Novel Method for VANET Improvement using Cloud Computing
In this paper, we present a novel algorithm for VANET using cloud computing. We accomplish processing, routing and traffic control in a centralized and parallel way by adding one or more server to the network. Each car or node is considered a Client, in such a manner that routing, traffic control, getting information from client and data processing and storing are performed by one or more serve...
متن کاملDiscrete Galerkin Method for Higher Even-Order Integro-Differential Equations with Variable Coefficients
This paper presents discrete Galerkin method for obtaining the numerical solution of higher even-order integro-differential equations with variable coefficients. We use the generalized Jacobi polynomials with indexes corresponding to the number of homogeneous initial conditions as natural basis functions for the approximate solution. Numerical results are presented to demonstrate the effectiven...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Scientific and Statistical Computing
سال: 1986
ISSN: 0196-5204,2168-3417
DOI: 10.1137/0907024